Stefan Friedl Research Statement
نویسنده
چکیده
Recent Research: Slice knots. A knot K ⊂ S is called slice, if it bounds a smooth 2-disk in D. In higher odd dimensions Levine [Le69], [Le69b] found a computable algebraic method of determining whether a knot is slice or not. In 1975 Casson and Gordon [CG86] first found examples which show that the high dimensional results (which relied on the Whitney trick) can not be extended to the case of one dimensional knots. Recently Cochran, Orr and Teichner [COT03] constructed an infinite series of obstructions to finding slice disks for a given knot and used L–eta invariants to detect highly non–trivial examples. In my thesis [Fr04] I used (finite dimensional) eta invariants, introduced by Atiyah, Patodi and Singer [APS75], to give obstructions to a knot being slice. I also show that these obstructions contain and slightly extend the obstructions of Casson and Gordon (cf. also [Fr05e]). It follows from work of Taehee Kim [Ki04] and myself [Fr04] that the eta invariant obstruction is independent of the L–eta invariant obstruction, i.e. there are knots which have non-zero eta invariants but zero L–eta invariants and vice versa.
منابع مشابه
m at h . G T ] 3 1 A ug 2 00 5 REIDEMEISTER TORSION , THE THURSTON NORM AND HARVEY ’ S INVARIANTS STEFAN
Recently twisted and higher order Alexander polynomials were used by Cochran, Harvey, Friedl–Kim and Turaev to give lower bounds on the Thurston norm. We first show how Reidemeister torsion relates to these Alexander polynomials. We then give lower bounds on the Thurston norm in terms of the Reidemeister torsion which contain and extend all the above lower bounds and give an elegant reformulati...
متن کاملLinks not concordant to the Hopf link
We give new Casson–Gordon style obstructions for a two–component link to be topologically concordant to the Hopf link.
متن کاملDocumentation for Knottwister
We summarize the mathematics behind the computer program KnotTwister and explain some of its features.
متن کاملAn elementary proof of the group law for elliptic curves
We give a proof of the group law for elliptic curves using explicit formulas.
متن کاملAlgorithm for Finding Boundary Link Seifert Matrices
We explain an algorithm for finding a boundary link Seifert matrix for a given multivariable Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander polynomial.
متن کامل